package algorithm.swordoff;

/**
 * 二叉树的深度
 */

public class SQ55_1 {

    public int maxDepth(TreeNode root) {
        return root == null ? 0 : Math.max(maxDepth(root.left), maxDepth(root.right))+1;
    }

}
